Number of complete N-ary subtrees on Galton-Watson family trees
نویسنده
چکیده
We associate with a Bienaymé-Galton-Watson branching process a family tree rooted at the ancestor. For a positive integer N , define a complete N -ary tree to be the family tree of a deterministic branching process with offspring generating function s . We study the random variables VN,n and VN counting the number of disjoint complete N -ary subtrees, rooted at the ancestor, and having height n and ∞, respectively. Dekking (1991) and Pakes and Dekking (1991) find recursive relations for P (VN,n > 0) and P (VN > 0) involving the offspring probability generation function (pgf) and its derivatives. We extend their results determining the probability distributions of VN,n and VN . It turns out that they can be expressed in terms of the offspring pgf, its derivatives, and the above probabilities. We show how the general results simplify in case of fractional linear, geometric, Poisson, and one-or-many offspring laws.
منابع مشابه
Survival Probabilities for N -ary Subtrees on a Galton-Watson Family Tree
The family tree of a Galton-Watson branching process may contain N -ary subtrees, i.e. subtrees whose vertices have at least N ≥ 1 children. For family trees without infinite N -ary subtrees, we study how fast N -ary subtrees of height t disappear as t → ∞.
متن کاملThe shape of large Galton-Watson trees with possibly infinite variance
Let T be a critical or subcritical Galton-Watson family tree with possibly infinite variance. We are interested in the shape of T conditioned to have a large total number of vertices. For this purpose we study random trees whose conditional distribution given their size is the same as the respective conditional distribution of T. These random family trees have a simple probabilistic structure i...
متن کاملScaling limits of Markov branching trees, with applications to Galton-Watson and random unordered trees
We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the number of leaves or vertices. Such families are parameterized by sequences of distributions on partitions of the integers, that determine how the size of a ...
متن کاملAsymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
We consider conditioned Galton–Watson trees and show asymptotic normality of additive functionals that are defined by toll functions that are not too large. This includes, as a special case, asymptotic normality of the number of fringe subtrees isomorphic to any given tree, and joint asymptotic normality for several such subtree counts. Another example is the number of protected nodes. The offs...
متن کاملAsymptotic normality of fringe subtrees and additive functionals in conditioned Galton – Watson trees . ( Extended abstract )
We consider conditioned Galton–Watson trees and show asymptotic normality of additive functionals that are defined by toll functions that are not too large. This includes, as a special case, asymptotic normality of the number of fringe subtrees isomorphic to any given tree, and joint asymptotic normality for several such subtree counts. The offspring distribution defining the random tree is ass...
متن کامل